Caching Spreading Activation Search
نویسندگان
چکیده
Spreading activation search is an approach to determine similarity of graph vertices based on energy distribution. Computation of such energy distribution is defined by a simple, but time-expensive recurrent procedure. This paper introduces a caching strategy, which can speed up computation of energy distribution of vertices that are closely connected to already calculated vertices.
منابع مشابه
On finding power method in spreading activation search
Graph ranking algorithms such as PageRank and HITS share the common idea of calculating eigenvectors of graph adjacency matrices. This paper shows that the power method usually used to calculate eigenvectors is also present in a spreading activation search. In addition, we empirically show that spreading activation algorithm is able to converge on periodic graphs, where power method fails. Furt...
متن کاملDiscovering Latent Informaion by Spreading Activation Algorithm for Document Retrieval
Syntactic search relies on keywords contained in a query to find suitable documents. So, documents that do not contain the keywords but contain information related to the query are not retrieved. Spreading activation is an algorithm for finding latent information in a query by exploiting relations between nodes in an associative network or semantic network. However, the classical spreading acti...
متن کاملRetrieving Semantically Distant Analogies with Knowledge-Directed Spreading Activation
Techniques that traditionally have been useful for retrieving same domain analogies from small single use knowledge bases such as spreading activation and indexing on selected features are inadequate for retrieving cross domain analogies from large multi use knowledge bases In this paper we describe Knowledge Directed Spreading Activation KDSA a new method for retriev ing analogies in a large s...
متن کاملModels of EFL Learners’ Vocabulary Development: Spreading Activation vs. Hierarchical Network Model
Semantic network approaches view organization or representation of internal lexicon in the form of either spreading or hierarchical system identified, respectively, as Spreading Activation Model (SAM) and Hi- erarchical Network Model (HNM). However, the validity of either model is amongst the intact issues in the literature which can be studied through basing the instruction compatible wi...
متن کاملOptimizing Web Search Using Spreading Activation on the Clickthrough Data
In this paper, we propose a mining algorithm to utilize the user clickthrough data to improve search performance. The algorithm first explores the relationship between queries and Web pages and mine out co-visiting relationship as the virtual link among the Web pages, and then Spreading Activation mechanism is used to perform the query-dependent search. Our approach could overcome the challenge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007